基于DRGAN和支持向量机的合成孔径雷达图像目标识别

为解决SAR图像目标识别中样本缺乏和方位角敏感问题,提出了一种基于DRGAN和SVM的SAR图像目标识别算法。首先,采用多尺度分形特征对SAR图像进行增强,经过分割得到目标二值图像,基于Hu二阶矩估计目标的方位角。然后对估计得到的目标方位角进行量化编码,结合原始图像作为输入,对设计的DRGAN模型参数进行训练与优化。由于DRGAN中的深度生成模型将目标姿态与外观表示进行解耦设计,故可利用该模型将SAR图像样本变换到同一方位角区间。基于变换后的训练样本分别提取归一化灰度特征,利用SVM训练分类器。采用MSTAR数据集在多个不同操作条件下对提出的算法进行测试,实验结果表明,在带变体的标准操作条件下,能够达到97.97%的分类精度,优于部分基于CNN模型的分类精度,在4种扩展操作条件下的分类精度分别为97.83%,91.77%,97.11%和97.04%,均优于传统方法的分类精度。在SAR图像目标方位角估计存在一定误差的情况下,训练得到的GAN模型作为SAR图像目标旋转估计器,能够使得在不进行复杂样本预处理的前提下,仍然取得较高的SAR图像目标识别精度。     

基于目标跟踪的变电站隔离开关状态图像识别方法

为解决变电站中隔离开关状态的自动识别问题，提出了基于目标跟踪的开关分合状态图像识别方法。首先，基于隔离开关开合过程的动态视频，通过 Ｌａｓｓｏ正则化稀疏表示的目标跟踪模型对隔离开关运动轨迹进行识别；其次，利用隔离开关２个闸刀之间的距离自动识别算法获得开关的分合状态。实测结果表明，该方法可快速跟踪开关运行轨迹，实时对变电站中隔离开关状态进行准确识别。     

小尺度交通信号灯的检测与状态识别

交通信号灯识别包括检测和状态识别，在智能交通系统中发挥重要作用。基于YOLOv3算法提出了一种交通信号灯检测与状态识别模型。针对交通信号灯相较于交通场景中其他目标具有尺度小的特性进行了算法的设计：降低骨干网络的下采样倍率以增加小尺度目标的特征描述能力；通过增大特征图的尺度来改进多尺度特征融合；引入广义交并比作为检测任务的损失函数来改进目标边界框的回归效果。同时，根据交通信号灯本身的特性，使用颜色和形状约束的方法对信号灯进行状态识别和类别验证。最后在公开的Bosch交通信号灯数据集上和实际的城区道路进行了实验验证。实验结果表明，所提出的算法能够提升交通信号灯识别的精度和召回率，识别准确率可以达到90%左右。     

基于卷积神经网络的表情识别

在传统静态表情识别研究基础上,提出一种简单的人脸裁剪方法,再用浅层卷积神经网络进一步提取特征并进行表情识别。以CK+和JAFFE为实验数据集,进行预处理效果对比实验、数据增强实验、单种表情识别实验和跨数据集六分类实验。结果表明,针对数据量较少的情况,提出的表情识别方法效果明显且鲁棒性更优。     

基于GFU和分层LSTM的组群行为识别研究方法

提出一种以"关键人物"为核心，使用门控融合单元（GFU，Gated Fusion Unit）进行特征融合的组群行为识别框架，旨在解决两个问题：①组群行为信息冗余，重点关注关键人物行为特征，忽略无关人员对组群行为的影响；②组群内部交互行为复杂，使用GFU有效融合以关键人物为核心的交互特征，再通过LSTM时序建模成为表征能力更强的组群特征.最终，通过softmax分类器进行组群行为类别分类.该算法在排球数据集上取得了86.7%的平均识别率.     

Chemical-Shift Perturbations Reflect Bile Acid Binding to Norovirus Coat Protein: Recognition Comes in Different Flavors

Bile acids have been reported as important cofactors promoting human and murine norovirus (NoV) infections in cell culture. The underlying mechanisms are not resolved. Through the use of chemical shift perturbation (CSP) NMR experiments, we identified a low-affinity bile acid binding site of a human GII.4 NoV strain. Long-timescale MD simulations reveal the formation of a ligand-accessible binding pocket of flexible shape, allowing the formation of stable viral coat protein–bile acid complexes in agreement with experimental CSP data. CSP NMR experiments also show that this mode of bile acid binding has a minor influence on the binding of histo-blood group antigens and vice versa. STD NMR experiments probing the binding of bile acids to virus-like particles of seven different strains suggest that low-affinity bile acid binding is a common feature of human NoV and should therefore be important for understanding the role of bile acids as cofactors in NoV infection.     

一种高误码(n,k,m)非系统卷积码盲识别算法

针对信息截获等领域中的卷积码盲识别问题，提出一种高误码 (n,k,m)非系统卷积码盲识别算法。首先建立可变的数据矩阵模型，对侦收到的数据进行相关预处理，以减小误码对识别的影响，提高算法的容错性能；再对预处理后的数据矩阵进行统计分析，识别出卷积码的各项参数，并提取各个数据矩阵的校验序列；进而利用校验序列构建线性方程组求解生成多项式矩阵组，通过设定筛选生成多项式矩阵的条件，筛选出非系统卷积码的生成多项式矩阵，最终完成对非系统卷积码的识别。仿真实验表明，该算法可以对高误码(n,k,m)非系统卷积码实现有效的盲识别。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

一种广义不可分支持向量机算法

针对标准的C-SVM(C-support vector machine)算法在处理很多实际分类问题时，对识别错误代价损失差异很大的极端情况表现出的局限性，提出一种通用的 广义支持向量机算法。根据识别错误后所付出的代价，可以把最优分类面向代价损失低的一方进行推移，留给代价损失高的一方更大的空间，提高其识别率，从而减小识别错误后带来的代价损失。该方法进一步提高了标准C SVM的适用性以及样本的正确识别率，将新算法应用到高分辨雷达距离像的识别中，实验证明,广义C-SVM能取得比传统C-SVM更好的识别效果。